Hamming Distance as a Concept in DNA Molecular Recognition
نویسندگان
چکیده
منابع مشابه
Hamming Distance as a Concept in DNA Molecular Recognition
DNA microarrays constitute an in vitro example system of a highly crowded molecular recognition environment. Although they are widely applied in many biological applications, some of the basic mechanisms of the hybridization processes of DNA remain poorly understood. On a microarray, cross-hybridization arises from similarities of sequences that may introduce errors during the transmission of i...
متن کاملIntegrated Object Recognition with Extended Hamming Distance
We present a model-based object recognition metric integrated with the control system of a mobile robot. The metric draws on the information-theoretic framework of string processing. Object models and images are viewed as sequences of binary strings whose local pairwise similarities contribute to global matches. We present and analyze the results of evaluating the metric on several trash collec...
متن کاملHamming distance for conjugates
Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y) is always even, and must satisfy a further technical condition. By contrast, over an alphabet of...
متن کاملApproximate Hamming Distance in a Stream
We consider the problem of computing a (1+ε)-approximation of the Hamming distance between a pattern of length n and successive substrings of a stream. We first look at the one-way randomised communication complexity of this problem. We show the following: If Alice and Bob both share the pattern and Alice has the first half of the stream and Bob the second half, then there is an O(ε−4 log2 n) b...
متن کاملHamming Distance Metric Learning
Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to large-scale applications as they are storage efficient and permit exact sub-linear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACS Omega
سال: 2017
ISSN: 2470-1343,2470-1343
DOI: 10.1021/acsomega.7b00053